214 research outputs found
Internet routing paths stability model and relation to forwarding paths
Analysis of real datasets to characterize the local stability properties of the Internet routing paths suggests that extending the route selection criteria to account for such property would not increase the routing path length. Nevertheless, even if selecting a more stable routing path could be considered as valuable from a routing perspective, it does not necessarily imply that the associated forwarding path would be more stable. Hence, if the dynamics of the Internet routing and forwarding system show different properties, then one can not straightforwardly derive the one from the other. If this assumption is verified, then the relationship between the stability of the forwarding path (followed by the traffic) and the corresponding routing path as selected by the path-vector routing algorithm requires further characterization. For this purpose, we locally relate, i.e., at the router level, the stability properties of routing path with the corresponding forwarding path. The proposed stability model and measurement results verify this assumption and show that, although the main cause of instability results from the forwarding plane, a second order effect relates forwarding and routing path instability events. This observation provides the first indication that differential stability can safely be taken into account as part of the route selection process
Vehicular networking in the recursive internetwork architecture
Vehicles such as cars are expected to use communication technologies for retrieving different kinds of information and exchanging information with other vehicles for safety and infotainment purposes. This results in vehicular networks, where vehicles can connect to other vehicles or communication infrastructures such as Road Side Units. The Recursive Inter- Network Architecture (RINA) has been proposed as a Future Internet architecture. This paper investigates and analyses how vehicular networks can be supported by RINA and how a RINA based vehicular network architecture can be designed to support efficient management of mobile vehicles.Peer ReviewedPostprint (author's final draft
AnyTraffic labeled routing for static and dynamic traffic
This paper investigates routing algorithms that compute paths along which combined unicast and multicast traffic can be
forwarded altogether, i.e., over the same path. For this purpose, the concept of AnyTraffic group is introduced that defines a set of nodes capable to process both unicast and multicast traffic received from the same (AnyTraffic) tree. The resulting scheme is referred to as AnyTraffic routing. This paper defines a heuristic algorithm to accommodate the AnyTraffic group and to find the proper set of branch nodes of the tree. The algorithm supports dynamic changes of the leaf node set during multicast session
lifetime by adapting the corresponding tree upon deterioration threshold detection. Studies are performed for both static and
dynamic traffic scenarios to i) determine the dependencies of the algorithm (node degree, clustering coefficient and group size); and ii) evaluate its performance under dynamic conditions. Initial results show that the AnyTraffic algorithm can successfully handle dynamic requests while achieving considerable reduction of forwarding state consumption with small increase in bandwidth utilization compared to the Steiner Tree algorithm.Preprin
Reactive and proactive routing in labelled optical burst switching networks
Optical burst switching architectures without buffering capabilities are sensitive to burst congestion. The existence of a few highly congested links may seriously aggravate the network throughput. Proper
network routing may help in congestion reduction. The authors focus on adaptive routing strategies to be applied in labelled OBS networks, that is, with explicit routing paths. In particular, two isolated alternative routing algorithms that aim at network performance improvement because of reactive route selection are studied. Moreover, a nonlinear optimisation method for multi-path source-based routing, which aims at proactive congestion reduction is proposed. Comparative performance results are provided and some implementation issues are discussed.Postprint (published version
Experimenting with real application-specific QoS guarantees in a large-scale RINA demonstrator
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This paper reports the definition, setup and obtained results of the Fed4FIRE + medium experiment ERASER, aimed to evaluate the actual Quality of Service (QoS) guarantees that the clean-slate Recursive InterNetwork Architecture (RINA) can deliver to heterogeneous applications at largescale. To this goal, a 37Node 5G metro/regional RINA network scenario, spanning from the enduser to the server where applications run in a datacenter has been configured in the Virtual Wall experimentation facility. This scenario has initially been loaded with synthetic application traffic flows, with diverse QoS requirements, thus reproducing different network load conditions. Next,their experienced QoS metrics endtoend have been measured with two different QTAMux (i.e., the most accepted candidate scheduling policy for providing RINA with its QoS support) deployment scenarios. Moreover, on this RINA network scenario loaded with synthetic application traffic flows, a real HD (1080p) video streaming demonstration has also been conducted, setting up video streaming sessions to endusers at different network locations, illustrating the perceived Quality of Experience (QoE). Obtained results in ERASER disclose that, by appropriately deploying and configuring QTAMux, RINA can yield effective QoS support, which has provided perfect QoE in almost all locations in our demo when assigning video traffic flows the highest (i.e., Gold) QoS Cube.Peer ReviewedPostprint (author's final draft
Effective burst preemption in OBS network
Trabajo presentado al Workshop on High Performance Switching and Routing 2006, Poznan (Polonia), 7-9 de junio de 2006Burst preemption is the most effective technique to provide Quality of Service (QoS) differentiation in Optical Burst Switching (OBS) networks. Nonetheless, in conventional OBS architectures, when preemption happens the control packet corresponding to the preempted burst continues its travel to the destination node reserving resources at each node of the path. Therefore, an additional signaling procedure should be carried out to release these unnecessary reservations. In this paper we present novel control architecture to efficiently apply burst preemption without the need of the signaling procedure.
Analytical and simulation results prove the effectiveness of this proposal.This work has been partially funded by the e-Photon/ONe
project (IST FP6-001933) and the MEC (Spanish Ministry of
Education) under contract TEC2005-08051-C03-01
AnyTraffic routing algorithm for label-based forwarding
The high capacity provided by packet-switched
networks is supporting the proliferation of bandwidth intensive multimedia applications which require multicasting capability. As
a consequence on today’s networks, unicast and multicast traffic compete for shared resources where a router must maintain both
unicast and multicast forwarding states. Pursuing a forwarding state reduction, in this paper we introduce the novel concept
of AnyTraffic data group which consists of a group of nodes receiving both unicast and multicast traffic over the same single
minimum-cost network entity. A novel heuristic algorithm is specifically defined to accommodate such data group and has been compared with the standard shortest path (SP) algorithm - the optimal case for unicast routing - and a classical Steiner
tree (ST) heuristic algorithm - the optimal case for multicast routing. Exhaustive experiments have been performed to validate
the proposed algorithm.Postprint (published version
An analysis of Regenerator Placement strategies for a Translucent OBS network architecture
Most research works in optical burst switching (OBS) networks do not take into account the impact of physical layer impairments (PLIs) either by considering fully transparent (i.e., using optical 3R regeneration) or opaque (i.e., electrical
3R regeneration) networks. However, both solutions are not feasible for different reasons. In this paper, we propose a novel
translucent OBS (T-OBS) network architecture which aims at bridging the gap between the transparent and opaque solutions. In order to evaluate its performance, a formulation of the routing and regenerator placement and dimensioning problem (RRPD) is presented. Since such formulation results in a complex
problem, we also propose several alternative heuristic strategies. In particular, we evaluate the trade-off between optimality and
execution times provided by these methods. Finally, we conduct a series of simulation experiments that prove that the T-OBS
network model proposed effectively deals with burst losses caused by the impact of PLIs and ensures that the overall network
performance remains unaffected.Preprin
Effective amplification of real WDM burst traffic using optical gain clamping
Experimental studies of real optical burst traffic in WDM systems are performed with
optical gain clamping for stabilizing the EDFA amplification. Impairments of power variation due to burst are shown to be negligible.Postprint (published version
Non-linear optimization for multi-path source routing in OBS networks
Optical Burst Switching (OBS) architectures without buffering capabilities are sensitive to burst losses. A proper routing strategy may help to reduce such congestion. In this letter we present a novel approach for OBS multi-path source routing problem. Our solution is based on non-linear optimization with a straightforward calculation of partial derivatives. Simulation results demonstrate that optimized routing effectively reduces the overall burst loss probability with respect to shortest path and
deflection routing.Postprint (published version
- …